Lattice reduction

Results: 60



#Item
41“Ooh Aah... Just a Little Bit” : A small amount of side channel can go a long way Naomi Benger1 , Joop van de Pol2 , Nigel P. Smart2 , and Yuval Yarom1 1  School of Computer Science, The University of Adelaide, Austr

“Ooh Aah... Just a Little Bit” : A small amount of side channel can go a long way Naomi Benger1 , Joop van de Pol2 , Nigel P. Smart2 , and Yuval Yarom1 1 School of Computer Science, The University of Adelaide, Austr

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-06-02 03:54:18
42Lattice Attacks on Digital Signature Schemes N.A. Howgrave-Graham, N.P. Smart MCS Department HPL Laboratories Bristol HPL[removed]

Lattice Attacks on Digital Signature Schemes N.A. Howgrave-Graham, N.P. Smart MCS Department HPL Laboratories Bristol HPL[removed]

Add to Reading List

Source URL: www.hpl.hp.com

Language: English - Date: 1999-09-08 19:15:27
43Combining symbolic and numeric techniques for DL contents classification and analysis Jean-Charles LAMIREL, Yannick TOUSSAINT Abstract The goal of this article is to prove that the mixture of different classification and

Combining symbolic and numeric techniques for DL contents classification and analysis Jean-Charles LAMIREL, Yannick TOUSSAINT Abstract The goal of this article is to prove that the mixture of different classification and

Add to Reading List

Source URL: www.ercim.eu

Language: English - Date: 2008-12-08 05:11:33
44NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.

NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.

Add to Reading List

Source URL: math.stanford.edu

Language: English - Date: 2014-07-08 11:03:33
45Cryptanalysis of NTRU with two public keys Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France Email: [removed]

Cryptanalysis of NTRU with two public keys Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France Email: [removed]

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2011-09-02 16:54:04
46NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.

NON-SPLIT REDUCTIVE GROUPS OVER Z Brian Conrad Abstract. — We study the following phenomenon: some non-split connected semisimple Q-groups G admit flat affine Z-group models G with “everywhere good reduction” (i.e.

Add to Reading List

Source URL: math.stanford.edu

Language: English - Date: 2014-04-07 08:15:47
47Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia

Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2002-01-22 06:23:32
48PSEUDO–CODE FOR THE MLLL ALGORITHM ∗ † Keith Matthews The following pseudo–code is extracted from the CALC source file lll.c (available at http://www.numbertheory.org/calc/krm_calc.html) for

PSEUDO–CODE FOR THE MLLL ALGORITHM ∗ † Keith Matthews The following pseudo–code is extracted from the CALC source file lll.c (available at http://www.numbertheory.org/calc/krm_calc.html) for

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2011-09-25 12:09:55
49(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1

(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2011-09-25 12:54:28
50!

! " # $ " # %# &%# " " # %#

Add to Reading List

Source URL: www.signelec.com

Language: English - Date: 2010-02-23 06:23:32